Quantum Public-Key Cryptosystem Based on Super Dense Coding Technology

نویسندگان

  • Xiaoyu Li
  • Dexi Zhang
چکیده

In this paper we provide a quantum public-key cryptosystem based on super dense coding technology. A user Alice shares a set of Einstein-Podolsky-Rosen (EPR) pairs with a key management center (KMC) in which the particles hold by Alice are the private key and the particle hold by KMC are the public key. By the help of the key management center any other user can send encrypted message to Alice. Any one including KMC except Alice can’t recover the message. On the other hand digital signature can also be achieved by this public-key cryptosystem. In the cryptosystem one EPR pair can be used to encrypt two bits of the plain text. So it’s efficient. Finally we prove that our cryptosystem is robust against possible attacks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum McEliece public-key cryptosystem

The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantumMcEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the clas...

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

PKC-PC: A Variant of the McEliece Public Key Cryptosystem based on Polar Codes

Polar codes are novel and efficient error correcting codes with low encoding and decoding complexities. These codes have a channel dependent generator matrix which is determined by the code dimension, code length and transmission channel parameters. This paper studies a variant of the McEliece public key cryptosystem based on polar codes, called"PKC-PC". Due to the fact that the structure of po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCP

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013